Queuing model of a traffic bottleneck with bimodal arrival rate

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Step Tolling with Bottleneck Queuing Congestion

In most dynamic traffic congestion models, congestion tolls must vary continuously over time to achieve the full optimum. This is also the case in Vickrey's (1969) ‘bottleneck model’. To date, the closest approximations of this ideal in practice have so-called ‘step tolls’, in which the toll takes on different values over discrete time intervals, but is constant within each interval. Given the ...

متن کامل

A Continuous Review inventory Control Model within Batch Arrival Queuing Framework: A Parameter-Tuned Imperialist Competitive Algorithm

In this paper, a multi-product continues review inventory control problem within batch arrival queuing approach (MQr/M/1) is modeled to find the optimal quantities of maximum inventory. The objective function is to minimize summation of ordering, holding and shortage costs under warehouse space, service level, and expected lost-sales shortage cost constraints from retailer and warehouse viewpoi...

متن کامل

The Deterministic Bottleneck Model with Non-Atomistic Traffic

This paper investigates the conditions under which dominant airlines internalize self-imposed delays in a deterministic bottleneck model of airport pricing, complementing the similar analysis of Brueckner and Van Dender (BVD, 2008) for the standard congestion-pricing model. A unified model of bottleneck tolling includes untolled, uniform-, coarse-, multi-step-, and continuous-toll equilibria as...

متن کامل

A Queuing Model with Markovian Arrival and LCFS Priority System and General Time for Service

We consider a single server queuing system with repeated attempts in which customers arrive according a Markov arrival process (MAP) and with a LCFS PR discipline. The service times are independent and have a common general distribution. After service completion time the server initiates his search time with an arbitrary distribution function. We consider two cases where the maximum number of r...

متن کامل

On Bottleneck Product Rate Variation Problem with Batching

The product rate variation problem minimizes the variation in the rate at which different models of a common base product are produced on the assembly lines with the assumption of negligible switch-over cost and unit processing time for each copy of each model. The assumption of significant setup and arbitrary processing times forces the problem to be a two phase problem. The first phase determ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Journal of Modern Physics B

سال: 2016

ISSN: 0217-9792,1793-6578

DOI: 10.1142/s0217979215410015